Brookes Is Relaxed, Almost!
نویسندگان
چکیده
We revisit the Brookes [1996] semantics for a shared variable parallel programming language in the context of the Total Store Ordering (TSO) relaxed memory model. We describe a denotational semantics that is fully abstract for Brookes’ language and also sound for the new commands that are specific to TSO. Our description supports the folklore sentiment about the simplicity of the TSO memory model.
منابع مشابه
Comments on relaxed $(gamma, r)$-cocoercive mappings
We show that the variational inequality $VI(C,A)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-Lipschitzian mapping $A: Cto H$ with $r>gamma mu^2$, where$C$ is a nonempty closed convex subset of a Hilbert space $H$. Fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...
متن کاملNew algorithms for relaxed multiplication
In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. Here almost as quickly means that we need to pay a logarithmic overhead. In this paper, we will show how to reduce this logarithmic factor in the case when the cons...
متن کاملOn the Vector Variational-like Inequalities with Relaxed η-α Pseudomonotone Mappings
In this paper we introduce some new conditions of the solu- tions existence for variational-like inequalities with relaxed &eta-&alpha pseu- domonotone mappings in Banach spaces. The advantage of these new conditions is that they are easier to be veried than those that appear in some of the previous corresponding articles.
متن کاملAn Enhanced HL-RF Method for the Computation of Structural Failure Probability Based On Relaxed Approach
The computation of structural failure probability is vital importance in the reliability analysis and may be carried out on the basis of the first-order reliability method using various mathematical iterative approaches such as Hasofer-Lind and Rackwitz-Fiessler (HL-RF). This method may not converge in complicated problems and nonlinear limit state functions, which usually shows itself in the f...
متن کاملRelaxed Multiplication Using the Middle Product
In previous work, we have introduced the technique of relaxed power series computations. With this technique, it is possible to solve implicit equations almost as quickly as doing the operations which occur in the implicit equation. In this paper, we present a new relaxed multiplication algorithm for the resolution of linear equations. The algorithm has the same asymptotic time complexity as ou...
متن کامل